Circular Binary Strings without Zigzags
نویسندگان
چکیده
We study several enumerative properties of the set of all circular binary strings without zigzags and of the set of all (0, 1)-necklaces without zigzags, where a zigzag is a 1 followed and preceded by a 0 or a 0 followed and preceded by a 1.
منابع مشابه
Binary strings without zigzags
We study several enumerative properties of the set of all binary strings without zigzags, i.e., without substrings equal to 101 or 010 . Specifically we give the generating series, a recurrence and two explicit formulas for the number wm,n of these strings with m 1’s and n 0’s and in particular for the numbers wn = wn,n of central strings. We also consider two matrices generated by the numbers ...
متن کاملDe Bruijn Sequences for Fixed-Weight Binary Strings
De Bruijn sequences are circular strings of length 2n whose length n substrings are the binary strings of length n. Our focus is on creating circular strings of length (
متن کاملFixed-density De Bruijn Sequences
De Bruijn sequences are circular strings of length 2 whose substrings are the binary strings of length n. Our focus is on de Bruijn sequences for binary strings that have the same density (number of 1s). We construct circular strings of length ( n−1 d )
متن کاملDe Bruijn Sequences for the Binary Strings with Maximum Specified Density
A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n
متن کاملDe Bruijn Sequences for the Binary Strings with Maximum Density
A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n
متن کامل